Model Checking the Ant Colony Optimisation
نویسندگان
چکیده
We present a model for the travelling salesman problem (TSP) solved using the ant colony optimisation (ACO), a bio-inspired mechanism that helps speed up the search for a solution and that can be applied to many other problems. The natural complexity of the TSP combined with the selforganisation and emergent behaviours that result from the application of the ACO make model-checking this system a hard task. We discuss our approach for modelling the ACO in a well-known probabilistic model checker and describe results of verifications carried out using our model and a couple of probabilistic temporal properties. These results demonstrate not only the effectiveness of the ACO applied to the TSP, but also that our modelling approach for the ACO produces the expected behaviour. It also indicates that the same modelling could be used in other scenarios.
منابع مشابه
Niching for Ant Colony Optimisation
Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...
متن کاملConcealed Contributors to Result Quality — The Search Process of Ant Colony System
Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper rev...
متن کاملConcealed Contributors to Result Quality - The Search Process of Ant Colony System
Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper rev...
متن کاملApplication of Ant Colony Optimisation Algorithmon the Recursive Propagation Modelfor Urban Microcells
Ant Colony Optimisation algorithm a multi-agent approach to combinatorial optimisation problems is used for a simple ray tracing performed on only an ordinary bitmap of the city map. Together with the Berg’s recursive model a non-line-of-sight path loss could be calculated without any need of building database. In this way the coverage predictions for urban microcells could become extremely eas...
متن کاملA hybrid ant colony optimisation algorithm for job shop problems and its convergence analysis
This paper presents a hybrid ant colony optimisation (HACO) algorithm for solving job shop problems. The criterion considered is the maximum completion time, the so-called makespan. The HACO algorithm improves the performance of intelligence optimisation algorithm, which adopts ant colony optimisation (ACO) algorithm to search in the global solution space, and tabu search (TS) algorithm is util...
متن کامل